Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height

نویسنده

  • Helmut Prodinger
چکیده

Stanley and Callan considered Dyck paths where the lengths of the run to the origin is always odd resp. the last one even, and the other ones odd. These subclasses are also enumerated by (shifted) Catalan numbers. We study the (average) height of these objects, assuming all such Dyck paths of length 2n to be equally likely, and find that it behaves like ∼ √ πn, as in the unrestricted case. This classic result for unrestricted Dyck paths is from de Bruijn, Knuth and Rice [2], and to this day, there are no simpler proofs for this, although more general results have been obtained by Flajolet and Odlyzko [4].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dyck Paths with Peak- and Valley-Avoiding Sets

In this paper, we focus on Dyck paths with peaks and valleys, avoiding an arbitrary set of heights. The generating functions of such types of Dyck paths can be represented by continued fractions. We also discuss a special case that requires all peak and valley heights to avoid congruence classes modulo k. We study the shift equivalence on sequences, which in turn induces an equivalence relation...

متن کامل

A bijection on bilateral Dyck paths

It is known that both the number of Dyck paths with 2n steps and k peaks, and the number of Dyck paths with 2n steps and k steps at odd height, follow the Narayana distribution. In this paper we present a bijection which explicitly illustrates this equinumeracy. Moreover, we extend this bijection to bilateral Dyck paths. The restriction to Dyck paths preserves the number of contacts.

متن کامل

A 61 Integers 11 ( 2011 ) Counting Depth Zero Patterns in Ballot Paths

The purpose of this work is to extend the theory of finite operator calculus to the multivariate setting, and apply it to the enumeration of certain lattice paths. The lattice paths we consider are ballot paths. A ballot path is a path that stays weakly above the diagonal y = x, starts at the origin, and takes steps from the set {↑,→} = {u, r}. Given a string p from the set {u, r}∗, we want to ...

متن کامل

Asymptotics of the Average Height of 2-Watermelons with a Wall

Abstract. We generalize the classical work of de Bruijn, Knuth and Rice (giving the asymptotics of the average height of Dyck paths of length n) to the case of p– watermelons with a wall (i.e., to a certain family of p nonintersecting Dyck paths; simple Dyck paths being the special case p = 1.) We work out this asymptotics for the case p = 2 only, since the computations involved are already qui...

متن کامل

A Bijection Between 3-Motzkin Paths and Schröder Paths With No Peak at Odd Height

A new bijection between 3-Motzkin paths and Schröder paths with no peak at odd height is presented, together with numerous consequences involving related combinatorial structures such as 2-Motzkin paths, ordinary Motzkin paths and Dyck paths.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 117  شماره 

صفحات  -

تاریخ انتشار 2012